Short Disjoint Paths on Hyper ubi Graphs
نویسنده
چکیده
منابع مشابه
A simpler proof for the two disjoint odd cycles theorem
We give a short proof of the two disjoint odd cycles theorem which characterizes graphs without two vertex-disjoint odd cycles. Our proof does not depend on any matroid result. It only uses the two paths theorem, which characterizes graphs without two disjoint paths with specified ends (i.e, 2-linked graphs).
متن کاملar X iv : 1 40 1 . 80 96 v 2 [ co nd - m at . d is - n n ] 1 8 M ay 2 01 4 Shortest node - disjoint paths on random graphs
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...
متن کاملOn Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path from si to ti for each i = 1, . . . , k. In the corresponding optimization problem, the shortest disjoint paths problem, the vertex-disjoint paths Pi have to be chosen such that a given objective function is minimized. We...
متن کاملDisjoint Paths in Expander Graphs via Random Walks: A Short Survey
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Frieze and Upfal.
متن کاملEdge Disjoint Paths in Moderately Connected Graphs
We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible using paths that are mutually edge disjoint. This leads to a variety of classic NP-complete problems, for which approximability is not well understood. We show a polylogarithmic approximation algorithm for the undirected ...
متن کامل